Rational Generating Functions and Integer Programming Games
نویسندگان
چکیده
منابع مشابه
Rational Generating Functions and Integer Programming Games
We explore the computational complexity of computing pure Nash equilibria for a new class of strategic games called integer programming games with difference of piecewise linear convex payoffs. Integer programming games are games where players’ action sets are integer points inside of polytopes. Using recent results from the study of short rational generating functions for encoding sets of inte...
متن کاملShort rational generating functions and their applications to integer programming
In this paper, we provide an overview of rational generating function tools for encoding integer points inside a rational polyhedron, and we examine their applications to solving integer programming problems.
متن کاملCounting with rational generating functions
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input variables of the (quasi-polynomial) function are fixed, there is a polynomial time algorithm which converts between the two representations. Examples of such countin...
متن کاملGenerating functions and duality for integer programs
We consider the integer program P→max{c′x|Ax = y;x ∈ N}. Using the generating function of an associated counting problem, and a generalized residue formula of Brion and Vergne, we explicitly relate P with its continuous linear programming (LP) analogue and provide a characterization of its optimal value. In particular, dual variables λ ∈ R have discrete analogues z ∈ C, related in a simple mann...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2011
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.1110.0964